Automata Theory and Infinite Transition Systems ∗
نویسنده
چکیده
These lecture notes report on the use of automata theory in the study of infinite transition systems. This application of automata is an important ingredient of the current development of “infinite-state system verification”, and it provides an introduction into the field of “algorithmic model theory”, a study of infinite models with an emphasis on computability results.
منابع مشابه
Finite Automata and the Analysis of Infinite Transition Systems
In this tutorial, we present basic concepts and results from automata theory for the description and analysis of infinite transition systems. We introduce and discuss the classes of rational, automatic, and prefix-recognizable graphs and in each case address the question whether over such graphs the model-checking problem (with respect to natural logics) is decidable. Then we treat two differen...
متن کاملA theory of stochastic systems part I: Stochastic automata
This paper presents the theoretical underpinning of a model for symbolically representing probabilistic transition systems, an extension of labelled transition systems for the modelling of general (discrete as well as continuous or singular) probability spaces. These transition systems are particularly suited for modelling softly timed systems, real-time systems in which the time constraints ar...
متن کاملAdding Monotonic Counters to Automata and Transition Graphs
We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß. We show that, for linearbounded automata, this extension does not increase the language recognition power. In the framework of infinite transition systems developed by Caucal and others, we show that adding monotonic counters to s...
متن کاملSymbolic Determinisation of Extended Automata
We define a symbolic determinisation procedure for a class of infinite-state systems, which consists of automata extended with symbolic variables that may be infinite-state. The subclass of extended automata for which the procedure terminates is characterised as bounded lookahead extended automata. It corresponds to automata for which, in any location, the observation of a bounded-length trace ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کامل